Zero Knowledge with Rubik's Cubes
نویسندگان
چکیده
Since the invention of the Rubik’s cube by Ernö Rubik in 1974, similar puzzles have been produced, with various number of faces or stickers. We can use these toys to define several problems in computer science, such as go from one state of the puzzle to another one. In this paper, we will classify some of these problems based on the classic Rubik’s cube or on generalized Rubik’s Cube. And we will see how we can use them in Zero Knowledge Authentication with a public key in order to achieve a given complexity against the best known attacks (for example 2 computations). The efficiency of these schemes, and their possible connection with NP-complete problems will also be discussed.
منابع مشابه
Zero Knowledge with Rubik's Cubes and Non-abelian Groups
The factorization problem in non-abelian groups is still an open and a difficult problem [12]. The hardness of the problem is illustrated by the moves of the Rubik’s cube. We will define a public key identification scheme based on this problem, in the case of the Rubik’s cube, when the number of moves is fixed to a given value. Our scheme consists of an interactive protocol which is zero-knowle...
متن کاملQuality Isosurface Mesh Generation Using an Extended Marching Cubes Lookup Table
The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table, the extended lookup table differentiates scalar values equal to the isovalue from scalar values g...
متن کاملThe Analogue of Büchi’s Problem for Cubes in Rings of Polynomials
Let F be a field of zero characteristic. We give the following answer to a generalization of a problem of Büchi over F [t]: A sequence of 92 or more cubes in F [t], not all constant, with third difference constant and equal to 6, is of the form (x+ n), n = 0, . . . , 91, for some x ∈ F [t] (cubes of successive elements). We use this, in conjunction to the negative answer to the analogue of Hilb...
متن کاملAlgorithms for Solving Rubik's Cubes
The Rubik’s Cube is perhaps the world’s most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik’s Cube also has a rich underlying algorithmic structure. Specifically, we show that the n×n×n Rubik’s Cube, as well as the n×n×1 variant, has a “God’s Number” (diameter of the configuration space) of Θ(n/ logn). ...
متن کاملDiophantine Approximation by Cubes of Primes and an Almost Prime II
Let λ1, . . . , λ4 be non-zero with λ1/λ2 irrational and negative, and let S be the set of values attained by the form λ1x 3 1 + · · · + λ4x4 when x1 has at most 3 prime divisors and the remaining variables are prime. We prove that most real numbers are close to an element of S.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012